Some Extremal Graphs with Respect to Sombor Index

Let G be a graph with set of vertices V(G)(|V(G)|=n) and edge E(G). Very recently, new degree-based molecular structure descriptor, called Sombor index is denoted by SO(G) defined as SO=SO(G)=∑vivj∈E(G)dG(vi)2+dG(vj)2, where dG(vi) the degree vertex vi in G. In this paper we present some lower upper bounds on terms parameters (clique number, chromatic number pendant vertices, etc.) characterize extremal graphs.